Makespan Minimization in Job Shops: A Linear Time Approximation Scheme

In this paper we present a linear time approximation scheme for the job shop scheduling problem with fixed number of machines and fixed number of operations per job. This improves on the previously best 2 + ǫ, ǫ > 0, approximation algorithm for the problem by Shmoys, Stein, and Wein. Our approximation scheme is very general and it can be extended to the case of job shop scheduling problems with release and delivery times, multi-stage job shops, dag job shops, and preemptive variants of these problems.